Deriving Tight Bell Inequalities for 2 Parties with Many 2-valued Observables from Facets of Cut Polytopes
نویسندگان
چکیده
Relatively few families of Bell inequalities have previously been identified. Some examples are the trivial, CHSH, Imm22, and CGLMP inequalities. This paper presents a large number of new families of tight Bell inequalities for the case of many observables. For example, 44,368,793 inequivalent tight Bell inequalities other than CHSH are obtained for the case of 2 parties each with 10 2-valued observables. This is accomplished by first establishing a relationship between the Bell inequalities and the facets of the cut polytope, a well studied object in polyhedral combinatorics. We then prove a theorem allowing us to derive new facets of cut polytopes from facets of smaller polytopes by a process derived from FourierMotzkin elimination, which we call triangular elimination. These new facets in turn give new tight Bell inequalities. We give additional results for projections, liftings, and the complexity of membership testing for the associated Bell polytope.
منابع مشابه
Two-party Bell inequalities derived from combinatorics via triangular elimination
Abstract. Bell inequalities, originally introduced as a method to prove that some quantum states show nonlocal behavior, are now studied as a method to capture the extent of the nonlocality of quantum states. Tight Bell inequalities are considered to be more important than redundant ones. Despite the increasing importance of the study of Bell inequalities, few kinds of tight Bell inequalities h...
متن کاملA complete set of multidimensional Bell inequalities
We give a multidimensional generalisation of the complete set of Bell-correlation inequalities given by Werner and Wolf in [31], and by Ẑukowski and Brukner in [32], for the two-dimensional case. Our construction applies for the n parties, two-observables case, where each observable is d-valued. The d n inequalities obtained involve homogeneous polynomials. They define the facets of a polytope ...
متن کاملFacets for node-capacitated multicut polytopes from path-block cycles with two common nodes
Path-block-cycle inequalities are valid, and sometimes facet-defining, inequalities for polytopes in connection with graph partitioning problems and corresponding multicut problems. Special cases of the inequalities were introduced by De Souza & Laurent (1995) and shown to be facet-defining for the equicut polytope. Generalizations of these inequalities were shown by Ferreira et al. (1996) to b...
متن کاملBell inequalities stronger than the CHSH inequality for 3-level isotropic states
Abstract We show that some two-party Bell inequalities with two-valued observables are stronger than the CHSH inequality for 3⊗3 isotropic states in the sense that they are violated by some isotropic states in the 3 ⊗ 3 system that do not violate the CHSH inequality. These Bell inequalities are obtained by applying triangular elimination to the list of known facet inequalities of the cut polyto...
متن کاملCausal structures from entropic information: geometry and novel scenarios
Bellʼs theorem in physics, as well as causal discovery in machine learning, both face the problem of deciding whether observed data is compatible with a presumed causal relationship between the variables (for example, a local hidden variable model). Traditionally, Bell inequalities have been used to describe the restrictions imposed by causal structures on marginal distributions. However, some ...
متن کامل